Sum divisor cordial labeling in the context of graph operations on grötzsch

A Sum divisor cordial labeling of a graph G with vertex set V is bijection r from to {1,2,3,...,|V (G )|} such that an edge uv assigned the label 1 if 2 divides r(u)+ (v ) and 0 otherwise; number edges labeled 1differ by at most . sum called graph. In this research paper, we investigate bahevior for Grötzsch graph, fusion any two vertices in duplication arbitrary switching degree four three path union copies Grötzsch.